Variables psicológicas que impulsan la difusión del rumor / Psychological variables which boost dissemination of rumor
نویسندگان
چکیده
منابع مشابه
Rumor Cascades
Online social networks provide a rich substrate for rumor propagation. Information received via friends tends to be trusted, and online social networks allow individuals to transmit information to many friends at once. By referencing known rumors from Snopes.com, a popular website documenting memes and urban legends, we track the propagation of thousands of rumors appearing on Facebook. From th...
متن کاملWord of Mouth: Rumor Dissemination in Social Networks
In this paper we examine the diffusion of competing rumors in social networks. Two players select a disjoint subset of nodes as initiators of the rumor propagation, seeking to maximize the number of persuaded nodes. We use concepts of game theory and location theory and model the selection of starting nodes for the rumors as a strategic game. We show that computing the optimal strategy for both...
متن کاملRumor Source Detection for Rumor Spreading on Random Increasing Trees
In a recent paper, Shah and Zaman proposed the rumor center as an effective rumor source estimator for rumor spreading on random graphs. They proved for a very general random tree model that the detection probability remains positive as the number of nodes to which the rumor has spread tends to infinity. Moreover, they derived explicit asymptotic formulas for the detection probability of random...
متن کاملRumor Processes On
We study four discrete-time stochastic systems on N, modeling processes of rumor spreading. The involved individuals can either have an active or a passive role, speaking up or asking for the rumor. The appetite for spreading or hearing the rumor is represented by a set of random variables whose distributions may depend on the individuals. Our goal is to understand—based on the distribution of ...
متن کاملRandomness-Efficient Rumor Spreading
We study the classical rumor spreading problem, which is used to spread information in an unknown network with n nodes. We present the first protocol for any expander graph G with n nodes and minimum degree Θ(n) such that, the protocol informs every node in O(log n) rounds with high probability, and uses O(log n log log n) random bits in total. The runtime of our protocol is tight, and the rand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Comunicación de la SEECI
سال: 2016
ISSN: 1576-3420
DOI: 10.15198/seeci.2016.40.104-121